A Survey on-Confidentiality Preserving in Instant Runoff Voting Method
نویسندگان
چکیده
منابع مشابه
Estimating the Margin of Victory for Instant-Runoff Voting
A general definition is proposed for the margin of victory of an election contest. That definition is applied to Instant Runoff Voting (IRV)1 and several estimates for the IRV margin of victory are described: two upper bounds and two lower bounds. Given round-by-round vote totals, the time complexity for calculating these bounds does not exceed O(C logC), where C is the number of candidates. It...
متن کاملFrequency of monotonicity failure under Instant Runoff Voting: estimates based on a spatial model of elections
It has long been recognized that Instant Runoff Voting (IRV) suffers from a defect known as nonmonotonicity, wherein increasing support for a candidate among a subset of voters may adversely affect that candidate’s election outcome. The expected frequency of this type of behavior, however, remains an open and important question, and limited access to detailed election data makes it difficult to...
متن کاملA Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting
Numerous methods have been proposed to conduct cryptographically secure elections. Most of these protocols focus on 1-out-of-n voting schemes. Few protocols have been devised for preferential voting systems, in which voters provide a list of rankings of the candidates, and many of those treat ballots as if they were ballots in a 1-out-of-n voting scheme. We propose a linked-list-based scheme th...
متن کاملBallot (and voter) “exhaustion” under Instant Runoff Voting: An examination of four ranked-choice elections
Some proponents of municipal election reform advocate for the adoption of Instant Runoff Voting (IRV), a method that allows voters to rank multiple candidates according to their preferences. Although supporters claim that IRV is superior to the traditional primaryrunoff election system, research on IRV is limited. We analyze data taken from images of more than 600,000 ballots cast by voters in ...
متن کاملConfidentiality-Preserving Refinement
We develop a condition for confidentiality-preserving refinement which is both necessary and sufficient. Using a slight extension of CSP as notation, we give a toy example to illustrate the usefulness of our condition. Systems are specified by their behavior and a window. For an abstract system, the window specifies what information is allowed to be observed by its environment. For a concrete s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2019
ISSN: 0975-8887
DOI: 10.5120/ijca2019918551